Algorithms for dynamic geometric data streams
نویسنده
چکیده
Acknowledgements First of all I would like to thank my advisor Christian Sohler for his great support. It was not always easy to keep pace with his great ability to find interesting problems and develop new ideas to solve them. During the whole time he gave me the feeling that I can always ask (even stupid) questions and was responsible for the great atmosphere in Paderborn. Without the fun I had at work I would have never been able to develop the results presented in this thesis. I also benefited a lot from the great experience of my co-advisor Friedhelm Meyer auf der Heide. He gave me the opportunity to come to Paderborn and the freedom to choose a research area to work on. He always lent a sympathetic ear for all kinds of problems. I would also like to thank Friedhelm's whole research group for the nice time in Paderborn. Then I would like to thank Kristina for her patience, empathy, love, and all the other things that make it so worthwhile to know her. She turned even the most stressful days into a wonderful time. Finally I would like to thank those whom I owe the most: my parents, Adolf and Margret. They always gave me the feeling to be loved and supported, whatever I am going to do in my life.
منابع مشابه
Clustering High Dimensional Dynamic Data Streams
We present data streaming algorithms for the kmedian problem in high-dimensional dynamic geometric data streams, i.e. streams allowing both insertions and deletions of points from a discrete Euclidean space {1, 2, . . .∆}. Our algorithms use k −2poly(d log ∆) space/time and maintain with high probability a small weighted set of points (a coreset) such that for every set of k centers the cost of...
متن کاملMining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows
Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...
متن کاملارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملSensitivity Sampling Over Dynamic Geometric Data Streams with Applications to k-Clustering
Sensitivity based sampling is crucial for constructing nearly-optimal coreset for k-means / median clustering. In this paper, we provide a novel data structure that enables sensitivity sampling over a dynamic data stream, where points from a high dimensional discrete Euclidean space can be either inserted or deleted. Based on this data structure, we provide a one-pass coreset construction for k...
متن کاملSingle-Pass Algorithms for Mining Frequency Change Patterns with Limited Space in Evolving Append-Only and Dynamic Transaction Data Streams
In this paper, we propose an online single-pass algorithm MFC-append (Mining Frequency Change patterns in append-only data streams) for online mining frequent frequency change items in continuous append-only data streams. An online space-efficient data structure called ChangeSketch is developed for providing fast response time to compute dynamic frequency changes between data streams. A modifie...
متن کاملData Streaming Algorithms for Geometric Problems
A data stream is an ordered sequence of points that can be read only once or a small number of times. Formally, a data stream is a sequence of points x1, x2 . . . , xi, . . . , xn read in increasing order of the indices i. The performance of the algorithm is measured on the number of passes the algorithm must make over the data under limited memory constraints. The data streaming model is motiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006